A new method for seeking initial basic feasible solution of linear programming problem 一種求線(xiàn)性規(guī)劃問(wèn)題的初始基本可行解的新方法
This paper presents a simple approach to working out the basic feasible solution directly in linear programming , which avoids introducing artificial variables , decreases memory , and generally gets a better basic feasible solution at a quicker speed 摘要本文給出直接求線(xiàn)性規(guī)劃問(wèn)題基可行解的一種簡(jiǎn)易方法,該方法既避免了引入人工變量,減少存儲(chǔ),一般又能較快地得到一個(gè)較好的基可行解。